US Army Aviation air movement operations assignment, utilization and routing

Purpose The purpose of this study was to create an air movement operations planning model rapidly generate mission request (AMR) assignment and routing courses action (COA) in order minimize unsupported AMRs, aircraft utilization cost. Design/methodology/approach In paper, the US Army Aviation problem is modeled as a mixed integer linear program (MILP) extension dial-a-ride (DARP). paper also introduces heuristic single-vehicle DARP demand insertion algorithm feasible solutions tactically useful time period. Findings MILP generates optimal for small problems (low numbers AMRs helicopter fleets). near-optimal various sizes (up 100 10 team fleet size) near real time. Research limitations/implications Due inability produce mid- large-sized problems, research limited commenting on solution quality beyond numerical experimentation. Additionally, authors make several simplifying assumptions generalize average performance capabilities throughout flight. Originality/value This first solve via single formulation that incorporates multiple refuel nodes, minimization by priority level, windows, penalties, windows maximum duration passenger ride limits.